Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques in order to reduce several variants of KPC to...
متن کاملThe 0-1 Knapsack problem with a single continuous variable
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure ...
متن کاملSolving the 0-1 Multidimensional Knapsack Problem with Resolution Search
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0–1 Multidimensional Knapsack Problem. This algorithm is able to prove large–scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
متن کاملA Partitioning Scheme for Solving the 0-1 Knapsack Problem
The application of valid inequalities to provide relaxations which can produce tight bounds, is now common practice in Combinatorial Optimisation. This paper attempts to complement current theoretical investigations in this regard. We experimentally search for "valid" equalities which have the potential of strengthening the problem's formulation. Recently, Martello and Toth [13] included cardin...
متن کاملA Hypecube Algorithm for the 0/1 Knapsack Problem
Many combinatorial optimization problems are known to be NP-complete. A common point of view is that finding fast algorithms for such problems using polynomial number of processors is unlikely. However facts of this kind usually are established for "worst" case situations and in practice many instances of NP-complete problems are successfully solved in polynomial time by such traditional combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Operations Research and Information Systems
سال: 2012
ISSN: 1947-9328,1947-9336
DOI: 10.4018/joris.2012010101